Plummeting Broadcast Storm Problem in Highways by Clustering Vehicles Using Dominating Set and Set Cover
نویسندگان
چکیده
منابع مشابه
Edge-Dominating Set Problem
We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge ...
متن کاملGeometric Dominating Set and Set Cover via Local Search
In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating set problem, for a given set of objects as input, the objective is to choose minimum number of input objects such that every input object is dominated by the chosen set of objects. Here, one object is dominated by the other if both of them have non-empty intersection regi...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملThe Pipelined Set Cover Problem
A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an abstraction of this problem as a generalization of set cover called pipelined set cover, where the sets are applied sequentially to the elements to be covered and the elements covered at each stage are discarded. We show that several natural heuristics for this NP-...
متن کاملAlgorithms for connected set cover problem and fault-tolerant connected set cover problem
Given a set V of elements, S a family of subsets of V , and G a connected graph on vertex set S,a connected set cover (CSC) is a subfamily R of S such that every element in V is covered by at least one set of R, and the subgraph G[R] of G induced by R is connected. If furthermore G[R] is k-connected and every element in V is covered by at least m sets inR, thenR is a (k,m)-CSC. In this paper, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2019
ISSN: 1424-8220
DOI: 10.3390/s19092191